A Note on Non-complete Problems in NPR
نویسندگان
چکیده
منابع مشابه
A Note on Non-complete Problems in NPImage
This note deals with the structure of the class NPR introduced by L. Blum, M. Shub, and S. Smale (1989, Bull. Amer. Math. Soc. 21, 1 46). It is shown that, assuming NPR 3 PR poly, there exists a problem NPR"(PR poly) which is not NPR-complete (w.r.t PR poly reductions). It also clarifies the scope of a padding technique used in a former similar result by R. Ladner (1975, J. Assoc. Comput. Mach....
متن کاملA note on symmetric duality in vector optimization problems
In this paper, we establish weak and strong duality theorems for a pair of multiobjective symmetric dual problems. This removes several omissions in the paper "Symmetric and self duality in vector optimization problem, Applied Mathematics and Computation 183 (2006) 1121-1126".
متن کاملA note on maximal non-prime ideals
The rings considered in this article are commutative with identity $1neq 0$. By a proper ideal of a ring $R$, we mean an ideal $I$ of $R$ such that $Ineq R$. We say that a proper ideal $I$ of a ring $R$ is a maximal non-prime ideal if $I$ is not a prime ideal of $R$ but any proper ideal $A$ of $R$ with $ Isubseteq A$ and $Ineq A$ is a prime ideal. That is, among all the proper ideals of $R$,...
متن کاملA Note on Complete Integrals
We present a theorem concerning the representation of solutions of a first-order partial differential equation in terms of a complete integral of the equation. We discuss the geometrical significance of that theorem.
متن کاملA Note on Passepartout Problems
This note provides a methodological contribution to the allocation of joint revenues obtained from passepartouts. In a passepartout system a group of service providers offers a passepartout that allows its owners the use of specified services for an unlimited number of times during a fixed period of time. The corresponding allocation problem is then how to share the total joint revenues of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2000
ISSN: 0885-064X
DOI: 10.1006/jcom.1999.0537